Reverse graph self-attention for target-directed atomic importance estimation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for Directed Graph Estimation

A problem of estimating the intrinsic graph structure from observed data is considered. The observed data in this study is a matrix with elements representing dependency between nodes in the graph. Each element of the observed matrix represents, for example, co-occurrence of events at two nodes, or correlation of variables corresponding to two nodes. The dependency does not represent direct con...

متن کامل

Directed Self-Assembly Using Graph Grammars

In this paper we describe the graph grammar approach to modeling self-assembly. The approach is used to describe how the topology of an assembling aggregate changes as it grows. The main purpose of the paper is to demonstrate the utility of the approach by giving detailed examples. We also describe the beginnings of our approach to physically embedding graph grammar assembly rules in physical s...

متن کامل

Missile target accuracy estimation with importance splitting

Article history: Received 7 February 2011 Received in revised form 1 September 2011 Accepted 2 December 2011 Available online 8 December 2011

متن کامل

Directed prime graph of non-commutative ring

Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$.  Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...

متن کامل

Separation Properties for Graph-Directed Self-Similar Fractals

Examples of “separation properties” for iterated function systems of similitudes include: the open set condition, the weak separation property, finite type. Alternate descriptions for these properties and relations among these properties have been worked out. Here we consider the same situation for “graph-directed” iterated function systems, and provide the definitions and proofs for that setti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neural Networks

سال: 2021

ISSN: 0893-6080

DOI: 10.1016/j.neunet.2020.09.022